Efficient Computation of Regularized Boolean Operations on the Extreme Vertices Model in the n-Dimensional Space (nD-EVM)
نویسنده
چکیده
The objective behind this work is to describe the Extreme Vertices Model in the n-Dimensional Space (nD-EVM) and the way it represents nD Orthogonal Pseudo Polytopes (nD-OPPs) by considering only a subset of their vertices: the Extreme Vertices. There are presented the Regularized Boolean Operators and the way they assure the dimensional homogeneity. Algorithms for performing Regularized Boolean Operations under the nD-EVM will be presented and details about an experimental time complexity analysis will be given in order to sustain the efficiency shared by the model when these operations take place through the described procedures. Finally, it is shown, as an example of application, an alternative representation for 3D datasets (voxelizations). The proposal establishes to model datasets as four-dimensional polytopes where the fourth dimension corresponds to color. Then, it will be shown how the 4D representation is concisely expressed through the EVM.
منابع مشابه
Novel Representation of Multidimensional Datasets: The Framework nD-EVM/Kohonen
In this paper we are going to describe the steps that conform a novel approach for representation of multidimensional datasets through the proposed Framework nD-EVM/Kohonen. In this sense two phases are going to be taken in account: 1) the application of 1-Dimensional Kohonen Self-Organizing Maps (1D-KSOMs) in order to achieve (n-1)D hypervoxelizations' segmentations, n ≥ 2, taking in account t...
متن کاملEfficient Boundary Extraction from Orthogonal Pseudo-Polytopes: An Approach Based on the nD-EVM
This work is devoted to contribute with two algorithms for performing, in an efficient way, connected components labeling and boundary extraction from orthogonal pseudo-polytopes. The proposals are specified in terms of the extreme vertices model in the n-dimensional space nDEVM . An overview of the model is presented, considering aspects such as its fundamentals and basic algorithms. The tempo...
متن کاملSolving Point and Plane vs. Orthogonal Polyhedra Using the Extreme Vertices Model (evm)
In a previous work, Orthogonal Polyhedra (OP) were proposed as geometric bounds in CSG. Primitives in the CSG model were approximated by their respective bounding boxes. The polyhedrical bound for the CSG object was obtained by applying the corresponding Boolean Algebra to those boxes. Also in that paper, a specific and very concise model for representing and handling OP was presented: the Extr...
متن کاملA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points w...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کامل